The presence of exponentiality in entropy maximized M/GI/1 queues

It is known that entropy maximised MlGI/l queues yield queue length distributions that are geometric when the constraints involve only the first two moments of the service time distribution. By proving that geometric queue lenth is equivalent to exponential service in MlGIil queues, we show that using the entropy maximisation procedure with only two service time moments is equivalent to using exponentially distributed service times. Thus, by identifying the parameter of the equivalent service time disuibution, we can compute such entropy maximised solutions via classical :MIMil theory. In case an additional constraint is used to preserve the probability of an empty queue, the service time distribution becomes a mixure of two disoibutions, one of which is exponential, and the other an impulse function of unit mass at the origin. In this case, except for the probability of an empty queue, the remaining queue length probabilities folIowa geomeoic sequence. In either case, our results demonstrate the presence of exponentiality in the service times of entropy maximised MlOI/l queues.